منابع مشابه
Relaxed Belief Propagation for MIMO Detection
In this paper, relaxed belief propagation (RBP) based detectors are proposed for multiple-input multiple-out (MIMO) system. The factor graph is leveraged to represent the MIMO channels, and based on which our algorithms are developed. Unlike the existing complicated standard belief propagation (SBP) detector that considers all the edges of the factor graph when updating messages, the proposed R...
متن کاملStochastic Belief Propagation on Trees
For exact inference, Belief Propagation(BP) on trees requires O(Td2) operations, where T is the number of variables and d is the cardinality of all hidden variables. This quadratic complexity becomes prohibitive when d is large. Stochastic Belief Propagation(SBP)[1] is an approximate inference algorithm which utilizes subtle changes to original BP in order to achieve O(1/ √ τ) error in O(τTd) t...
متن کاملOptimal Quantization for Sparse Reconstruction with Relaxed Belief Propagation
Compressive sensing theory has demonstrated that sparse signals can be recovered from a small number of random linear measurements. However, for practical purposes, like storage, transmission, or processing with modern digital equipment, continuous-valued compressive sensing measurements need to be quantized. In this thesis we examine the topic of optimal quantization of compressive sensing mea...
متن کاملLifted Stochastic Planning, Belief Propagation and Marginal MAP
It is well known that the problems of stochastic planning and probabilistic inference are closely related. This paper makes several contributions in this context for factored spaces where the complexity of solutions is challenging. First, we analyze the recently developed SOGBOFA heuristic, which performs stochastic planning by building an explicit computation graph capturing an approximate agg...
متن کاملBelief Propagation and Spectral Methods Belief Propagation and Spectral Methods
We investigate an algorithm derived based on the belief propagation method of Pearl [11] applied to the (Min-)Bisection problem under the standard planted solution model (or more precisely the Most Likely Partition problem under the same planted solution model). We first point out that the algorithm (without thresholding) is nothing but the standard power method for computing an eigenvector wit...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Communications
سال: 2013
ISSN: 0090-6778
DOI: 10.1109/tcomm.2013.021913.120149